Dynamic storage allocation with limited compaction - complexity and some practical implications
نویسندگان
چکیده
منابع مشابه
Generalized Dynamic Storage Allocation
Dynamic Storage Allocation is a problem concerned with storing items that each have weight and time restrictions. Approximate algorithms have been constructed through online coloring of interval graphs. We present a generalization that uses online coloring of tolerance graphs. We utilize online-with-representation algorithms on tolerance graphs, which are online algorithms in which the correspo...
متن کاملDiscrete Element Modeling of Dynamic Compaction with Different Tamping Condition
Dynamic Compaction (DC) is a common deep compaction method that is usually used for densification of coarse-grained soils. Although traditional continuum-based models such as the Finite Element Method can be successfully applied for assessment of stress distributions or deformations induced by DC, they are typically not adequate for capturing the grain scale mechanisms of soil behavior under im...
متن کاملSpecialized Hardware Support for Dynamic Storage Allocation
SPECIALIZED HARDWARE SUPPORT FOR DYNAMIC STORAGE ALLOCATION by Steven M. Donahue ADVISOR: Dr. Ron K. Cytron May, 2003 Saint Louis, Missouri With the advent of operating systems and programming languages that can evaluate and guarantee real-time specifications, applications with real-time requirements can be authored in higher-level languages. For example, a version of Java suitable for real-tim...
متن کاملScalability of Dynamic Storage Allocation Algorithms
Dynamic storage allocation has a signi cant impact on computer performance. A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time of their creation. A good dynamic storage allocator should utilize storage e ciently and satisfy requests in as few instructions as possible. A dynamic storage allocator on a multiprocessor should have the abili...
متن کاملDynamic Storage Allocation on a Computer with Virtual Memory
We compare several dynamic storage strategies under the assumption that they will be used on a computer with virtual memory. On such a computer the total (virtual) memory referenced by a process may exceed the actual amount of random-access memory available to the process, and it is usually more important to minimize the number of page faults than the virtual memory required by the process. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1985
ISSN: 0166-218X
DOI: 10.1016/0166-218x(85)90046-0